A New Generalization of Chebyshev Inequality for Random Vectors
نویسنده
چکیده
In this article, we derive a new generalization of Chebyshev inequality for random vectors. We demonstrate that the new generalization is much less conservative than the classical generalization. 1 Classical Generalization of Chebyshev inequality The Chebyshev inequality discloses the fundamental relationship between the mean and variance of a random variable. Extensive research works have been devoted to its generalizations for random vectors. For example, various generalizations can be found in Marshall and Olkin (1960), Godwin (1955), Mallows (1956) and the references therein. A natural generalization of Chebyshev inequality is as follows. For a random vector X ∈ R with cumulative distribution F (.), Pr {||X − E[X]| | ≥ ε} ≤ Var(X) ε2 ∀ε > 0 (1) where ||.|| denotes the Euclidean norm of a vector and Var(X) def = ∫ V ∈ R ||V − E[X]||dF (V ) This classical generalization can be found in a number of textbooks of probability theory and statistics (see, e.g., pp. 446-451 of Laha and Rohatgi (1979)). ∗The author is with Department of Electrical and Computer Engineering, Louisiana State University, Baton Rouge, LA 70803; Email: [email protected].
منابع مشابه
Some inequalities of birandom variable and their applications∗
Birandom variable is a generalization of random variable, which is defined as a measurable function from a probability space to the set of random variables. In order to further explore the mathematical properties of birandom variable, this paper first investigates several inequalities for birandom variables based on the chance measure and expected value operator, which are analogous to Hölder’s...
متن کاملTransductive-Inductive Cluster Approximation Via Multivariate Chebyshev Inequality
Approximating adequate number of clusters in multidimensional data is an open area of research, given a level of compromise made on the quality of acceptable results. The manuscript addresses the issue by formulating a transductive inductive learning algorithm which uses multivariate Chebyshev inequality. Considering clustering problem in imaging, theoretical proofs for a particular level of co...
متن کاملResults of the Chebyshev type inequality for Pseudo-integral
In this paper, some results of the Chebyshev type integral inequality for the pseudo-integral are proven. The obtained results, are related to the measure of a level set of the maximum and the sum of two non-negative integrable functions. Finally, we applied our results to the case of comonotone functions.
متن کاملHadamard Product Versions of the Chebyshev and Kantorovich Inequalities
The purpose of this note is to prove Hadamard product versions of the Chebyshev and the Kantorovich inequalities for positive real numbers. We also prove a generalization of Fiedler’s inequality.
متن کاملGeneralization of the Lyapunov type inequality for pseudo-integrals
We prove two kinds of Lyapunov type inequalities for pseudo-integrals. One discusses pseudo-integrals where pseudo-operations are given by a monotone and continuous function g. The other one focuses on the pseudo-integrals based on a semiring 0; 1 ½ ; sup; ð Þ , where the pseudo-multiplication is generated. Some examples are given to illustrate the validity of these inequalities. As a generali...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/0707.0805 شماره
صفحات -
تاریخ انتشار 2007